Affine and general linear equivalences of boolean functions
نویسندگان
چکیده
منابع مشابه
Classification of Boolean Functions where Affine Functions are Uniformly Distributed
Classification of Non-linear Boolean functions is a long-standing problem in the area of theoreticalcomputer science. In this paper, effort has been made to achieve a systematic classification of all n-variableBoolean functions, where only one affine Boolean function belongs to each class. Two different methods areproposed to achieve this classification. The first method is a recurs...
متن کاملLinear symmetries of Boolean functions
In this note we study the linear symmetry group LS(f ) of a Boolean function f of n variables, that is, the set of all ∈ GLn(2) which leave f invariant, where GLn(2) is the general linear group on the field of two elements. The main problem is that of concrete representation: which subgroups G of GLn(2) can be represented as G= LS(f ) for some n-ary k-valued Boolean function f. We call such sub...
متن کاملGeneral branching functions of affine Lie algebras
Explicit expressions are presented for general branching functions for cosets of affine Lie algebras ĝ with respect to subalgebras ĝ′ for the cases where the corresponding finite dimensional algebras g and g′ are such that g is simple and g′ is either simple or sums of u(1) terms. A special case of the latter yields the string functions. Our derivation is purely algebraical and has its origin i...
متن کاملAffine equivalence of cubic homogeneous rotation symmetric Boolean functions
Homogeneous rotation symmetric Boolean functions have been extensively studied in recent years because of their applications in cryptography. Little is known about the basic question of when two such functions are affine equivalent. The simplest case of quadratic rotation symmetric functions which are generated by cyclic permutations of the variables in a single monomial was only settled in 200...
متن کاملRepresenting Boolean Functions as Linear Pseudo-Boolean Constraints
A linear pseudo-Boolean constraint (LPB) is an expression of the form a1 · l1 + . . .+am · lm ≥ d, where each li is a literal (it assumes the value 1 or 0 depending on whether a propositional variable xi is true or false) and the a1, . . . , am, d are natural numbers. The formalism can be viewed as a generalisation of a propositional clause. It has been said that LPBs can be used to represent B...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1980
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(80)90299-5